Orientations historiographiques

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Therapeutic Orientations

In the past century, a number of psychotherapeutic orientations have gained popularity for treating mental illnesses. This module outlines some of the best-known therapeutic approaches and explains the history, techniques, advantages, and disadvantages associated with each. The most effective modern approach is cognitive behavioral therapy (CBT). We also discuss psychoanalytic therapy, personce...

متن کامل

Listing All st-Orientations

See examples in Fig. 1(b). Many graph algorithms use an st-orientation. For instance, graph drawing algorithms [3], [4], [17], [19], [22], routing algorithms [1], [13] and partitioning algorithms [14]. Given a biconnected graph G and its two vertices s and t, one can find an st-orientation of G in O(m + n) time [5], [6], [22]. Note that if G is not biconnected then G may have no st-orientation....

متن کامل

One-Way Trail Orientations

Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins’ theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is 2-edge connected. A natural extension of this problem is the following: Suppose that the edges of the graph is partitioned into trails. Can we orient the tr...

متن کامل

Estimating local multiple orientations

In the last decades, orientation estimation has often been investigated for instance in the domain of still image analysis for feature extraction [5] or in the context of video stream processing for motion analysis [10] [20] [27]. Applications of orientation estimation vary, for example, from the enhancement of ancient engravings to the analysis of fingerprint images or seismic data [8]. Orient...

متن کامل

Equivalences on Acyclic Orientations

The cyclic and dihedral groups can be made to act on the set Acyc(Y ) of acyclic orientations of an undirected graph Y , and this gives rise to the equivalence relations ∼κ and ∼δ, respectively. These two actions and their corresponding equivalence classes are closely related to combinatorial problems arising in the context of Coxeter groups, sequential dynamical systems, the chip-firing game, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Clio

سال: 2008

ISSN: 1252-7017,1777-5299

DOI: 10.4000/clio.8512